منابع مشابه
Quantum Sampling for Balanced Allocations
It is known that the original Grover Search (GS) can be modified to use a general value for the phase θ of the diffusion transform. Then, if the number of answers is relatively large, this modified GS can find one of the answers with probability one in a single iteration. However, such a quick and error-free GS can only be possible if we can initially adjust the value of θ correctly against the...
متن کاملStratified Median Ranked Set Sampling: Optimum and Proportional Allocations
In this paper, for the Stratified Median Ranked Set Sampling (SMRSS), proposed by Ibrahim et al. (2010), we examine the proportional and optimum sample allocations that are two well-known methods for sample allocation in stratified sampling. We show that the variances of the mean estimators of a symmetric population in SMRSS using optimum and proportional allocations to strata are smaller than ...
متن کاملEfficient allocations under ambiguity
An important implication of the expected utility model under risk aversion is that if agents have the same probability belief, then the efficient allocations under uncertainty are comonotone with the aggregate endowment, and if their beliefs are concordant, then the efficient allocations are measurable with respect to the aggregate endowment. We study these two properties of efficient allocatio...
متن کاملImplementation of Pareto Efficient Allocations ∗
This paper considers Nash implementation and double implementation of Pareto efficient allocations for production economies. We allow production sets and preferences are unknown to the planner. We present a well-behaved mechanism that fully implements Pareto efficient allocations in Nash equilibrium. The mechanism then is modified to fully doubly implement Pareto efficient allocations in Nash a...
متن کاملFinding Fair and Efficient Allocations
We study the problem of allocating indivisible goods fairly and efficiently among a set of agents who have additive valuations for the goods. Here, an allocation is said to be fair if it is envy-free up to one good (EF1), which means that each agent prefers its own bundle over the bundle of any other agent, up to the removal of one good. In addition, an allocation is deemed to be efficient if i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics & Probability Letters
سال: 1997
ISSN: 0167-7152
DOI: 10.1016/s0167-7152(97)00007-2